Genetic Algorithms are NOT Function Optimizers
نویسنده
چکیده
Genetic Algorithms (GAs) have received a great deal of attention regarding their potential as optimization techniques for complex functions. The level of interest and success in this area has led to a number of improvements to GA-based function optimizers and a good deal of progress in characterizing the kinds of functions that are easy/hard for GAs to optimize. With all this activity, there has been a natural tendency to equate GAs with function optimization. However, the motivating context of Holland’s initial GA work was the design and implementation of robust adaptive systems. In this paper we argue that a proper understanding of GAs in this broader adaptive systems context is a necessary prerequisite for understanding their potential application to any problem domain. We then use these insights to better understand the strengths and limitations of GAs as function optimizers.
منابع مشابه
Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics
In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...
متن کاملOn the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
This work proposes a quantitative, non-parametric interpretation of statistical performance of stochastic multiobjective optimizers, including, but not limited to, genetic algorithms. It is shown that, according to this interpretation, typical performance can be defined in terms analogous to the notion of median for ordinal data, as can other measures analogous to other quantiles. Non-parametri...
متن کاملOptimizing Join Orders
Recent developments in database technology, such as deductive database systems, have given rise to the demand for new, cost-eeective optimization techniques for join expressions. In this paper many diierent algorithms that compute approximative solutions for optimizing join orders are studied since traditional dynamic programming techniques are not appropriate for complex problems. First, two p...
متن کاملMulti-objective Optimisation and Multi-criteria Decision Making in SLS Using Evolutionary Approaches
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ’Ra’ and build time ’T ’, for object manufacturing in SLS process. The optimization task is carried out by two popularly known multi-objective evolutionary optimizers NSGA-II (non-dominated sorting genetic algorithm) and MOPSO (multi-objective particle swarm optimizer)...
متن کاملGA Optimization for RFID Broadband Antenna Applications
This paper examines genetic algorithm optimizers in antenna design. Specifically, we evaluate whether GA optimizers are appropriate design techniques for RFID broadband antenna design by looking at current research with GA antennas and deducing whether similar optimizers can be applied to RFID broadband antennas such as bowtie designs.
متن کاملDecision making in an Adaptive Reservoir Genetic Algorithm
It is now common knowledge that blind search algorithms cannot perform with equal efficiency on all possible optimization problems defined on a domain. This knowledge applies also to Genetic Algorithms when viewed as global and blind optimizers. From this point of view it is necessary to design algorithms capable of adapting their search behaviour by making use in a direct fashion of the knowle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992